Towards a Theory of Movie Database Queries
نویسندگان
چکیده
We present a data model for movies and movie databases. A movie is considered to be a 2-dimensional semialgebraic figure that can change in time. We give a number of computability results concerning movies: it can be decided whether a frame of a movie is only a topologically transformation of another frame; a movie has a finite number of scenes and cuts and these can be effectively computed. Based on these computability results we define an SQLlike query language for movie databases. This query language supports most movie editing operations like cutting, pasting and selection of scenes.
منابع مشابه
Apply Uncertainty in Document-Oriented Database (MongoDB) Using F-XML
As moving to big data world where data is increasing in unstructured way with high velocity, there is a need of data-store to store this bundle amount of data. Traditionally, relational databases are used which are now not compatible to handle this large amount of data, so it is needed to move on to non-relational data-stores. In the current study, we have proposed an extension of the Mongo...
متن کاملApply Uncertainty in Document-Oriented Database (MongoDB) Using F-XML
As moving to big data world where data is increasing in unstructured way with high velocity, there is a need of data-store to store this bundle amount of data. Traditionally, relational databases are used which are now not compatible to handle this large amount of data, so it is needed to move on to non-relational data-stores. In the current study, we have proposed an extension of the Mongo...
متن کاملDemo of SemIndex: Semantic-Aware Inverted Index on Text
Processing keyword-based queries is a central problem in Information Retrieval (IR), where several studies have been done to develop effective keyword-based search techniques [1, 2]. A standard containment keyword-based query, which retrieves textual identities that contain a set of keywords, is generally supported by a full-text index. The inverted index is considered as one of the most useful...
متن کاملRelational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملQueries over Virtual Nested Objects
We describe a system that allows the easy specification and efficient support of queries specified as a set of attribute/ predicate/value triplets over virtual nested objects constructed from relational databases. For example, the Internet Movie Database (imdb) provides virtual nested objects such as ”movies” (each one containing a movie tuple, multiple actor tuples and more) and ”actors” (cont...
متن کامل